Quantum and classical complexity classes: Separations, collapses, and closure properties
نویسندگان
چکیده
منابع مشابه
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties
Separations, Collapses, and Closure Properties Holger Spakowski1?, Mayur Thakur2??, and Rahul Tripathi2? ? ? 1 Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, 40225 Düsseldorf, Germany. [email protected] 2 Department of Computer Science, University of Rochester, Rochester, NY 14627, USA. fthakur,[email protected] Abstract. We study the complexity of quantum c...
متن کاملUncountable classical and quantum complexity classes
Polynomial–time constant–space quantum Turing machines (QTMs) and logarithmic–space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakaryılmaz 2014, arXiv:1411.7647). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough...
متن کاملInterpolating Between Quantum and Classical Complexity Classes
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: ⋆ Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In particular, we show that while (⋆) is doable in quantum randomized polynomial time when m=2 (and no classical randomized polynomial time algorithm is known), (⋆) i...
متن کامل1 Sharp quantum vs . classical query complexity separations ∗
We obtain the strongest separation between quantum and classical query complexity known to date—specifically, we define a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved exactly in the quantum case with a single query (and a polynomial number of auxiliary operations). The problem is simple to define and the quantum algorithm solv...
متن کاملRelationships Between Quantum and Classical Space-Bounded Complexity Classes
This paper investigates the relative power of space-bounded quantum and classical (probabilistic) computational models. The following relationships are proved. 1. Any probabilistic Turing machine (PTM) which runs in space s and which halts absolutely (i.e. halts with certainty after a nite number of steps) can be simulated in space O(s) by a quantum Turing machine (QTM). If the PTM operates wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2005
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.10.009